Secure Two-Party Computation: Generic Approach and Exploiting Specific Properties of Functions Approach
نویسندگان
چکیده
Introduced by Yao in early 1980s, secure computation is being one among the major area of research interest among cryptologists. In three decades of its growth, secure computation which can be called as two-party computation, or multiparty computation depending on the number of parties involved has experienced vast diversities. Research has been carried out by exploiting specific properties of functionalities and generic approach to achieve efficient practical secure computation protocols. This paper considers the application secure two-party computation of AES-128 for comparison of the above two approaches.
منابع مشابه
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies a protocol with complexity at least linear in the input size. In fact, linear running time is inherent for secure computation of non-trivial functions, since each party must “touch” every bit of their input lest inform...
متن کاملFaster Secure Two-Party Computation Using Garbled Circuits
Secure two-party computation enables two parties to evaluate a function cooperatively without revealing to either party anything beyond the function’s output. The garbled-circuit technique, a generic approach to secure two-party computation for semi-honest participants, was developed by Yao in the 1980s, but has been viewed as being of limited practical significance due to its inefficiency. We ...
متن کاملCryptographic Security for Mobile Code
This paper addresses the protection of mobile code against cheating and potentially malicious hosts. We point out that the recent approach based on computing with “encrypted functions” is limited to the case where only the code originator learns the result of the computation and the host running the code must not notice anything at all. We argue that if the host is to receive some output of the...
متن کاملRound-Optimal Token-Based Secure Computation
Secure computation in the presence of tamper-proof hardware tokens is proven under the assumption that the holder of the token is only given black-box access to the functionality of the token. Starting with the work of Goldreich and Ostrovsky [GO96], a long series of works studied tamper-proof hardware for realizing two-party functionalities in a variety of settings. In this work we focus our a...
متن کاملFaster Secure Computation through Automatic Parallelization
Secure two-party computation (TPC) based on Yao’s garbled circuits has seen a lot of progress over the past decade. Yet, compared with generic computation, TPC is still multiple orders of magnitude slower. To improve the efficiency of secure computation based on Yao’s protocol, we propose a practical parallelization scheme. Its advances over existing parallelization approaches are twofold. Firs...
متن کامل